Towards a Semantics for Prioritised Alternation
نویسنده
چکیده
A new prioritised alternation programming construct and CSP operator have previously been suggested by the author to express behaviour that arises with machine-level prioritised vectored interruption. The semantics of each is considered, though that of prioritisation is deferred given the current lack of consensus regarding a suitable domain. Defining axioms for the operator are tentatively proposed, along with possible laws regarding behaviour. Lastly, the issue of controlled termination of component and construct is explored. This is intended as only a first step towards a complete semantics.
منابع مشابه
Argumentation Semantics for Prioritised Default Logic
We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions. Argumentation semantics for PDL will allow for the application of argument game proof theories to the process of inference in PDL, making the reasons for accepting a...
متن کاملLexical Semantics and Selection of TAM in Bantu Languages: A Case of Semantic Classification of Kiswahili Verbs
The existing literature on Bantu verbal semantics demonstrated that inherent semantic content of verbs pairs directly with the selection of tense, aspect and modality formatives in Bantu languages like Chasu, Lucazi, Lusamia, and Shiyeyi. Thus, the gist of this paper is the articulation of semantic classification of verbs in Kiswahili based on the selection of TAM types. This is because the sem...
متن کاملPrioritised Default Logic as Rational Argumentation
We endow Brewka’s prioritised default logic (PDL) with argumentation semantics using the ASPIC framework for structured argumentation. We prove that the conclusions of the justified arguments correspond to the prioritised default extensions in a normatively rational manner. Argumentation semantics for PDL will allow for the application of argument game proof theories to the process of inference...
متن کاملAlternation in Quantum Programming: From Superposition of Data to Superposition of Programs
We extract a novel quantum programming paradigm superposition of programs from the design idea of a popular class of quantum algorithms, namely quantum walkbased algorithms. The generality of this paradigm is guaranteed by the universality of quantum walks as a computational model. A new quantum programming language QGCL is then proposed to support the paradigm of superposition of programs. Thi...
متن کاملPrioritised Service Architecture
Previously, Martin [1] gave formal conditions under which a simple design rule guarantees deadlock-freedom in a system with service (client-server) architecture. Both conditions and design rule may be statically verfied. Here, they are re-arranged to define service protocol, service network (system), and service network component, which together form a model for system abstraction. Adding mutua...
متن کامل